New Formulations for the Traveling Repairman Problem
نویسندگان
چکیده
Given a complete directed graph G = (V,E), the traveling repairman problem consists of determining a Hamiltonian circuit minimizing the sum of the waiting times of customers located at the nodes of the graph. In this paper, we propose two new linear integer formulations for TRP and computationally evaluate the strength of their linear programming relaxations. Computational results show the efficiency of the second new formulation considering the LP relaxations gaps and CPU times. The larger instance solved to optimality with the proposed second formulation involves 29 vertices. This compares favorably with a previously published formulation.
منابع مشابه
A Review on Traveling Repairman Problem
Suppose G=(V,A) be an undirected graph with n nodes and a source vertex s Є V. Each node has a problem that must be solved by the repairman that has send. We are given the time required by the repairman to travel among nodes. The objective is to find a tour that minimizes the total waiting time of all the problems that are waiting to be solved. Traveling Repairman problem (TRP) is also known as...
متن کاملمدلی جدید برای حل مسئله تعمیرکار سیار بر پایه برنامهریزی عدد صحیح آمیخته
The Traveling Repairman Problem is a customer-oriented routing problem in which a repairman is visiting a set of geographically distributed customers. The objective function is to minimize the total waiting times of all customers. The importance of this problem can be found in its applications in the following areas: blood distributing, manufacturing systems, and transportation and logistics. A...
متن کاملEfficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.
متن کاملSpeedup in the Traveling Repairman Problem with Unit Time Windows
The input to the unrooted traveling repairman problem is an undirected metric graph and a subset of nodes, each of which has a time window of unit length. Given that a repairman can start at any location, the goal is to plan a route that visits as many nodes as possible during their respective time windows. A polynomial-time bicriteria approximation algorithm is presented for this problem, gain...
متن کاملSolving the Traveling Repairman Problem with Differentiated Waiting times through Lagrangian Relaxation
In this paper we present a formulation of the traveling repairman problem with differentiated waiting times that is derived from the extended disaggregated flow formulation for the asymmetric traveling salesman problem. We focus on the usage of the Lagrangian approach as a mechanism of speeding up the solution of the linear relaxation by a simplex method. We show some computational results.
متن کامل